A fast method for computing the principal nth roots of complex matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Method for Computing the Principal n th Roots of Complex Matrices*

Based on the generalized continued-fraction method for finding the nth roots of real numbers, this paper presents a fast computation method for finding the principal nth roots of complex matrices. Computation algorithms with high convergence rates are developed, and their global convergence properties are investigated from the viewpoint of systems theory.

متن کامل

A Parallel algorithm for principal nth roots of matrices

An iterative algorithm for computing the principal nth root of a positive deenite matrix is presented. The algorithm is based on the Gauss-Legendre approximation of a deenite integral. We p resent a parallelization in which we use as many processors as the order of the approximation. An analysis of the error introduced at each step of the iteration indicates that the algorithm converges more ra...

متن کامل

A Fast Method For Computing Principal Curvatures From Range Images

Estimation of surface curvature from range data is important for a range of tasks in computer vision and robotics, object segmentation, object recognition and robotic grasping estimation. This work presents a fast method of robustly computing accurate metric principal curvature values from noisy point clouds which was implemented on GPU. In contrast to existing readily available solutions which...

متن کامل

On computing complex square roots of real matrices

We present an idea for computing complex square roots of matrices using only real arithmetic.

متن کامل

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1986

ISSN: 0024-3795

DOI: 10.1016/0024-3795(86)90223-5